Small two-variable exponential Diophantine equations
نویسندگان
چکیده
منابع مشابه
Exponential Diophantine Equations
1. Historical introduction. Many questions in number theory concern perfect powers, numbers of the form a b where a and b are rational integers with <7>1, 6>1. To mention a few: (a) Is it possible that for /zs>3 the sum of two 77th powers is an /7th power? (b) Is 8, 9 the only pair of perfect powers which differ by 1 ? (c) Is it possible that the product of consecutive integers, (x+l)(x + 2) .....
متن کاملOn a Conjecture on Exponential Diophantine Equations
We deal with a conjecture of Terai (1994) asserting that if a, b, c are fixed coprime integers with min(a, b, c) > 1 such that a+b = c for a certain odd integer r > 1, then the equation a + b = c has only one solution in positive integers with min(x, y, z) > 1. Co-operation man-machine is needed for the proof.
متن کاملClass Numbers, Quadratics, and Exponential Diophantine Equations
We look at the relationships between class numbers of quadratic structures (orders and fields) and the solutions of exponential Diophantine equations. We conclude with necessary and sufficient conditions for a class group to have an element of a given order. 1. Notation and Preliminaries If D is a squarefree integer, then its discriminant is given by ( ) ( ) ≡ ≡/ = ∆ . 4 mod 1 if , 4 mod ...
متن کاملSmall solutions of linear Diophantine equations
Let Ax = B be a system of m x n linear equations with integer coefficients. Assume the rows of A are linearly independent and denote by X (respectively Y) the maximum of the absolute values of the m x m minors of the matrix A (the augmented matrix (A, B)). If the system has a solution in nonnegative integers, it is proved that the system has a solution X = (xi) in nonnegative integers with xi <...
متن کاملA Polynomial Time Algorithm for Diophantine Equations in One Variable
We show that the integer roots of of a univariate polynomial with integer coe cients can be computed in polynomial time This re sult holds for the classical i e Turing model of computation and a sparse representation of polynomials i e coe cients and exponents are written in binary and only nonzero monomials are represented
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1993
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1993-1160277-9